https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 On issues concerning the assessment of information contained in aggregate data using the F-statistics https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:15372 Wed 11 Apr 2018 10:19:10 AEST ]]> Time aggregation for network design to meet time-constrained demand https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:20350 Wed 04 Sep 2019 12:35:15 AEST ]]> A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximize flow through a transshipment node over time https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21703 a) a∈A. We permit parallel arcs, i.e. there may exist more than one arc in A having the same start and end node. By dδ¯(v) and dδ+ (v) we denote the set of incoming and outgoing arcs of node v, respectively. We consider this network over a set of T time periods indexed by the set [T] := {1, 2, . . . ,T }, and our objective is to maximize the total flow from s to t. In addition, we are given a subset J ⊆ A of arcs that have to be shut down for exactly one time period in the time horizon. In other words, there is a set of maintenance jobs, one for each arc in J, each with unit processing time. Our optimization problem is to choose these outage time periods in such a way that the total flow from s to t is maximized. More formally, this can be written as a mixed binary program as follows: (formula could not be replicated: see full text) where xai ≥ 0 for a ∈ A and i ∈ [T] denotes the flow on arc a in time period i, and yai ∈ {0, 1} for a ∈ J and i ∈ [T] indicates when the arc a is not shut down for maintenance in time period i. We present a branch-and-bound algorithm called the "Partial-State algorithm" to solve the problem for single transhipment node networks i.e. networks with |V| = 3. Unit processing time of each job leads to formation of symmetries in the solution space. We include powerful symmetry breaking rules in the algorithm to make it more efficient. We provide an easily-computer combinatorial expression that is proved to give the value of LP-relaxation of the problem at each node of the branch-and-bound tree. We also provide another upper bound which is even stronger than the LP value at each node of the tree, and show how this improves the run time of the algorithm.]]> Sat 24 Mar 2018 08:06:24 AEDT ]]> A comparison of the performance of digital elevation model pit filling algorithms for hydrology https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21704 Sat 24 Mar 2018 08:06:23 AEDT ]]> A variable sized bucket indexed formulation for nonpreemptive single machine scheduling problems https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:23491 Sat 24 Mar 2018 07:13:05 AEDT ]]>